The Steepest Descent Method for Orthogonal Polynomials on the Real Line with Varying Weights

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The ∂ Steepest Descent Method for Orthogonal Polynomials on the Real Line with Varying Weights

We obtain Plancherel-Rotach type asymptotics valid in all regions of the complex plane for orthogonal polynomials with varying weights of the form e−NV (x) on the real line, assuming that V has only two Lipschitz continuous derivatives and that the corresponding equilibrium measure has typical support properties. As an application we extend the universality class for bulk and edge asymptotics o...

متن کامل

The ∂ Steepest Descent Method and the Asymptotic Behavior of Polynomials Orthogonal on the Unit Circle with Fixed and Exponentially Varying Nonanalytic Weights

Abstract. We develop a new asymptotic method for the analysis of matrix Riemann-Hilbert problems. Our method is a generalization of the steepest descent method first proposed by Deift and Zhou; however our method systematically handles jump matrices that need not be analytic. The essential technique is to introduce nonanalytic extensions of certain functions appearing in the jump matrix, and to...

متن کامل

Varying weights for orthogonal polynomials with monotonically varying recurrence coefficients

and the coefficients in (1.3), which depend on the parameter N , {an,N : bn,N}n=0, bn,N > 0. ∗The authors acknowledge support from NATO Collaborative linkage grant PST.CLG.979738 and INTAS Research Network 03-51-6637. The first author was supported by grants RFBR-05-01-00522, NSh1551.2003.1, Program No. 1 DMS RAS. The second author was supported by an NSF grant. The third author was supported b...

متن کامل

On the Steepest Descent Method for Matrix

We consider the special case of the restarted Arnoldi method for approximating the product of a function of a Hermitian matrix with a vector which results when the restart length is set to one. When applied to the solution of a linear system of equations, this approach coincides with the method of steepest descent. We show that the method is equivalent with an interpolation process in which the...

متن کامل

On the Steepest Descent Method for Matrix

We consider the special case of the restarted Arnoldi method for approximating the product of a function of a Hermitian matrix with a vector which results when the restart length is set to one. When applied to the solution of a linear system of equations, this approach coincides with the method of steepest descent. We show that the method is equivalent with an interpolation process in which the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Mathematics Research Notices

سال: 2008

ISSN: 1687-0247,1073-7928

DOI: 10.1093/imrn/rnn075